Universal cycles for combinatorial structures
نویسندگان
چکیده
Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite set.
منابع مشابه
Universal structures Fan Chung cycles for combinatorial
Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite set.
متن کاملUniversal cycles for k-subsets of an n-set
Generalized from the classic de Bruijn sequence, a universal cycle is a compact cyclic list of information. Existence of universal cycles has been established for a variety of families of combinatorial structures. These results, by encoding each object within a combinatorial family as a length-j word, employ a modified version of the de Bruijn graph to establish a correspondence between an Eule...
متن کاملProducts of Universal Cycles
Universal cycles are generalizations of de Bruijn cycles to combinatorial patterns other than binary strings. We show how to construct a product cycle of two universal cycles, where the window widths of the two cycles may be different. Applications to card tricks are suggested.
متن کامل3 0 A ug 2 00 6 Universal Cycles on 3 – Multisets
Consider the collection of all t–multisets of {1, . . . , n}. A universal cycle on multisets is a string of numbers, each of which is between 1 and n, such that if these numbers are considered in t–sized windows, every multiset in the collection is present in the string precisely once. The problem of finding necessary and sufficient conditions on n and t for the existence of universal cycles an...
متن کاملUniversal Cycles for Weak Orders
Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992. They have been developed by many authors since, for various combinatorial objects such as strings, subsets, permutations, partitions, vector spaces, and designs. One generalization of universal cycles, which require almost complete overlap of consecutiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 110 شماره
صفحات -
تاریخ انتشار 1992